0.11/0.12	% Problem    : Vampire---4.8_31974 : TPTP v0.0.0. Released v0.0.0.
0.11/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n023.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1440
0.13/0.34	% WCLimit    : 180
0.13/0.34	% DateTime   : Mon Jul  3 13:13:06 EDT 2023
0.13/0.34	% CPUTime    : 
0.20/0.47	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.UMVeeTOOAH/Vampire---4.8_31974
0.20/0.47	# Version: 3.1pre001-ho
0.20/0.49	# partial match(1): HSSSSLSSSLMNHFN
0.20/0.49	# Preprocessing class: HSMSSLSSSLMNHFN.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.49	# Starting ho_unfolding_6 with 900s (5) cores
0.20/0.49	# Starting ehoh_best_sine_rwall with 180s (1) cores
0.20/0.49	# Starting pre_casc_5 with 180s (1) cores
0.20/0.49	# Starting ehoh_best_sine with 180s (1) cores
0.20/0.49	# ehoh_best_sine_rwall with pid 32153 completed with status 0
0.20/0.49	# Result found by ehoh_best_sine_rwall
0.20/0.49	# partial match(1): HSSSSLSSSLMNHFN
0.20/0.49	# Preprocessing class: HSMSSLSSSLMNHFN.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.49	# Starting ho_unfolding_6 with 900s (5) cores
0.20/0.49	# Starting ehoh_best_sine_rwall with 180s (1) cores
0.20/0.49	# SinE strategy is gf500_gu_R04_F100_L20000
0.20/0.49	# Search class: HGUSF-FFMS32-MHFFMFNN
0.20/0.49	# partial match(2): HGUSF-FFSF32-MHFFMFNN
0.20/0.49	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.49	# Starting new_ho_10 with 98s (1) cores
0.20/0.49	# new_ho_10 with pid 32157 completed with status 0
0.20/0.49	# Result found by new_ho_10
0.20/0.49	# partial match(1): HSSSSLSSSLMNHFN
0.20/0.49	# Preprocessing class: HSMSSLSSSLMNHFN.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.49	# Starting ho_unfolding_6 with 900s (5) cores
0.20/0.49	# Starting ehoh_best_sine_rwall with 180s (1) cores
0.20/0.49	# SinE strategy is gf500_gu_R04_F100_L20000
0.20/0.49	# Search class: HGUSF-FFMS32-MHFFMFNN
0.20/0.49	# partial match(2): HGUSF-FFSF32-MHFFMFNN
0.20/0.49	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.49	# Starting new_ho_10 with 98s (1) cores
0.20/0.49	# Preprocessing time       : 0.002 s
0.20/0.49	# Presaturation interreduction done
0.20/0.49	
0.20/0.49	# Proof found!
0.20/0.49	# SZS status Theorem
0.20/0.49	# SZS output start CNFRefutation
0.20/0.49	thf(decl_22, type, in: $i > $i > $o).
0.20/0.49	thf(decl_23, type, emptyset: $i).
0.20/0.49	thf(decl_24, type, setadjoin: $i > $i > $i).
0.20/0.49	thf(decl_25, type, dsetconstr: $i > ($i > $o) > $i).
0.20/0.49	thf(decl_26, type, subset: $i > $i > $o).
0.20/0.49	thf(decl_27, type, kpair: $i > $i > $i).
0.20/0.49	thf(decl_28, type, cartprod: $i > $i > $i).
0.20/0.49	thf(decl_29, type, singleton: $i > $o).
0.20/0.49	thf(decl_30, type, ex1: $i > ($i > $o) > $o).
0.20/0.49	thf(decl_31, type, breln: $i > $i > $i > $o).
0.20/0.49	thf(decl_32, type, func: $i > $i > $i > $o).
0.20/0.49	thf(decl_33, type, ap: $i > $i > $i > $i > $i).
0.20/0.49	thf(decl_34, type, funcGraphProp1: $o).
0.20/0.49	thf(decl_35, type, funcGraphProp2: $o).
0.20/0.49	thf(decl_36, type, esk1_3: $i > $i > $i > $i).
0.20/0.49	thf(decl_37, type, esk2_3: $i > $i > $i > $i).
0.20/0.49	thf(decl_38, type, esk3_0: $i).
0.20/0.49	thf(decl_39, type, esk4_0: $i).
0.20/0.49	thf(decl_40, type, esk5_0: $i).
0.20/0.49	thf(decl_41, type, esk6_1: $i > $i).
0.20/0.49	thf(decl_42, type, esk7_0: $i).
0.20/0.49	thf(decl_43, type, esk8_1: $i > $i).
0.20/0.49	thf(decl_44, type, esk9_0: $i).
0.20/0.49	thf(decl_45, type, esk10_0: $i).
0.20/0.49	thf(ex1, axiom, ((ex1)=(^[X1:$i, X3:$i > $o]:((singleton @ (dsetconstr @ X1 @ (^[X2:$i]:((X3 @ X2)))))))), file('/export/starexec/sandbox/tmp/tmp.UMVeeTOOAH/Vampire---4.8_31974', ex1)).
0.20/0.49	thf(singleton, axiom, ((singleton)=(^[X1:$i]:(?[X2:$i]:(((in @ X2 @ X1)&((X1)=(setadjoin @ X2 @ emptyset))))))), file('/export/starexec/sandbox/tmp/tmp.UMVeeTOOAH/Vampire---4.8_31974', singleton)).
0.20/0.49	thf(func, axiom, ((func)=(^[X1:$i, X4:$i, X6:$i]:(((breln @ X1 @ X4 @ X6)&![X2:$i]:(((in @ X2 @ X1)=>(ex1 @ X4 @ (^[X7:$i]:((in @ (kpair @ X2 @ X7) @ X6)))))))))), file('/export/starexec/sandbox/tmp/tmp.UMVeeTOOAH/Vampire---4.8_31974', func)).
0.20/0.49	thf(breln, axiom, ((breln)=(^[X1:$i, X4:$i, X5:$i]:((subset @ X5 @ (cartprod @ X1 @ X4))))), file('/export/starexec/sandbox/tmp/tmp.UMVeeTOOAH/Vampire---4.8_31974', breln)).
0.20/0.49	thf(funcGraphProp2, axiom, ((funcGraphProp2)<=>![X1:$i, X4:$i, X8:$i]:(((func @ X1 @ X4 @ X8)=>![X2:$i]:(((in @ X2 @ X1)=>![X7:$i]:(((in @ X7 @ X4)=>((in @ (kpair @ X2 @ X7) @ X8)=>((ap @ X1 @ X4 @ X8 @ X2)=(X7)))))))))), file('/export/starexec/sandbox/tmp/tmp.UMVeeTOOAH/Vampire---4.8_31974', funcGraphProp2)).
0.20/0.49	thf(funcGraphProp1, axiom, ((funcGraphProp1)<=>![X1:$i, X4:$i, X8:$i]:(((func @ X1 @ X4 @ X8)=>![X2:$i]:(((in @ X2 @ X1)=>(in @ (kpair @ X2 @ (ap @ X1 @ X4 @ X8 @ X2)) @ X8)))))), file('/export/starexec/sandbox/tmp/tmp.UMVeeTOOAH/Vampire---4.8_31974', funcGraphProp1)).
0.20/0.49	thf(funcextLem, conjecture, ((funcGraphProp1)=>((funcGraphProp2)=>![X1:$i, X4:$i, X8:$i]:(((func @ X1 @ X4 @ X8)=>![X9:$i]:(((![X2:$i]:((((ap @ X1 @ X4 @ X8 @ X2)=(ap @ X1 @ X4 @ X9 @ X2))<=(in @ X2 @ X1)))=>![X2:$i]:(((in @ X2 @ X1)=>![X7:$i]:(((in @ X7 @ X4)=>((in @ (kpair @ X2 @ X7) @ X9)=>(in @ (kpair @ X2 @ X7) @ X8)))))))<=(func @ X1 @ X4 @ X9))))))), file('/export/starexec/sandbox/tmp/tmp.UMVeeTOOAH/Vampire---4.8_31974', funcextLem)).
0.20/0.49	thf(c_0_7, plain, ((ex1)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((?[X26:$i]:(((in @ X26 @ (dsetconstr @ Z0 @ (^[Z2/* 3 */:$i]:((Z1 @ Z2)))))&((dsetconstr @ Z0 @ (^[Z2/* 3 */:$i]:((Z1 @ Z2))))=(setadjoin @ X26 @ emptyset)))))))), inference(fof_simplification,[status(thm)],[ex1])).
0.20/0.49	thf(c_0_8, plain, ((singleton)=(^[Z0/* 5 */:$i]:(?[X2:$i]:(((in @ X2 @ Z0)&((Z0)=(setadjoin @ X2 @ emptyset))))))), inference(fof_simplification,[status(thm)],[singleton])).
0.20/0.49	thf(c_0_9, plain, ((func)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((((subset @ Z2 @ (cartprod @ Z0 @ Z1)))&![X2:$i]:(((in @ X2 @ Z0)=>(?[X27:$i]:(((in @ X27 @ (dsetconstr @ Z1 @ (^[Z3/* 3 */:$i]:(((in @ (kpair @ X2 @ Z3) @ Z2))))))&((dsetconstr @ Z1 @ (^[Z3/* 3 */:$i]:(((in @ (kpair @ X2 @ Z3) @ Z2)))))=(setadjoin @ X27 @ emptyset))))))))))), inference(fof_simplification,[status(thm)],[func])).
0.20/0.49	thf(c_0_10, plain, ((breln)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((subset @ Z2 @ (cartprod @ Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[breln])).
0.20/0.49	thf(c_0_11, plain, ((ex1)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((?[X26:$i]:(((in @ X26 @ (dsetconstr @ Z0 @ (^[Z2/* 3 */:$i]:((Z1 @ Z2)))))&((dsetconstr @ Z0 @ (^[Z2/* 3 */:$i]:((Z1 @ Z2))))=(setadjoin @ X26 @ emptyset)))))))), inference(apply_def,[status(thm)],[c_0_7, c_0_8])).
0.20/0.49	thf(c_0_12, plain, ((func)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((((subset @ Z2 @ (cartprod @ Z0 @ Z1)))&![X2:$i]:(((in @ X2 @ Z0)=>(?[X27:$i]:(((in @ X27 @ (dsetconstr @ Z1 @ (^[Z3/* 3 */:$i]:(((in @ (kpair @ X2 @ Z3) @ Z2))))))&((dsetconstr @ Z1 @ (^[Z3/* 3 */:$i]:(((in @ (kpair @ X2 @ Z3) @ Z2)))))=(setadjoin @ X27 @ emptyset))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9, c_0_10]), c_0_11])).
0.20/0.49	thf(c_0_13, axiom, ((funcGraphProp2)=(![X1:$i, X4:$i, X8:$i]:((((((subset @ X8 @ (cartprod @ X1 @ X4)))&![X30:$i]:(((in @ X30 @ X1)=>(?[X31:$i]:(((in @ X31 @ (dsetconstr @ X4 @ (^[Z0/* 3 */:$i]:(((in @ (kpair @ X30 @ Z0) @ X8))))))&((dsetconstr @ X4 @ (^[Z0/* 3 */:$i]:(((in @ (kpair @ X30 @ Z0) @ X8)))))=(setadjoin @ X31 @ emptyset)))))))))=>![X2:$i]:(((in @ X2 @ X1)=>![X7:$i]:(((in @ X7 @ X4)=>((in @ (kpair @ X2 @ X7) @ X8)=>((ap @ X1 @ X4 @ X8 @ X2)=(X7))))))))))), inference(apply_def,[status(thm)],[funcGraphProp2, c_0_12])).
0.20/0.49	thf(c_0_14, axiom, ((funcGraphProp1)=(![X1:$i, X4:$i, X8:$i]:((((((subset @ X8 @ (cartprod @ X1 @ X4)))&![X28:$i]:(((in @ X28 @ X1)=>(?[X29:$i]:(((in @ X29 @ (dsetconstr @ X4 @ (^[Z0/* 3 */:$i]:(((in @ (kpair @ X28 @ Z0) @ X8))))))&((dsetconstr @ X4 @ (^[Z0/* 3 */:$i]:(((in @ (kpair @ X28 @ Z0) @ X8)))))=(setadjoin @ X29 @ emptyset)))))))))=>![X2:$i]:(((in @ X2 @ X1)=>(in @ (kpair @ X2 @ (ap @ X1 @ X4 @ X8 @ X2)) @ X8))))))), inference(apply_def,[status(thm)],[funcGraphProp1, c_0_12])).
0.20/0.49	thf(c_0_15, negated_conjecture, ~((![X32:$i, X33:$i, X34:$i]:((((subset @ X34 @ (cartprod @ X32 @ X33))&![X35:$i]:(((in @ X35 @ X32)=>?[X36:$i]:(((in @ X36 @ (dsetconstr @ X33 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ X35 @ Z0) @ X34)))))&((dsetconstr @ X33 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ X35 @ Z0) @ X34))))=(setadjoin @ X36 @ emptyset)))))))=>![X37:$i]:(((in @ X37 @ X32)=>(in @ (kpair @ X37 @ (ap @ X32 @ X33 @ X34 @ X37)) @ X34)))))=>(![X38:$i, X39:$i, X40:$i]:((((subset @ X40 @ (cartprod @ X38 @ X39))&![X41:$i]:(((in @ X41 @ X38)=>?[X42:$i]:(((in @ X42 @ (dsetconstr @ X39 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ X41 @ Z0) @ X40)))))&((dsetconstr @ X39 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ X41 @ Z0) @ X40))))=(setadjoin @ X42 @ emptyset)))))))=>![X43:$i]:(((in @ X43 @ X38)=>![X44:$i]:(((in @ X44 @ X39)=>((in @ (kpair @ X43 @ X44) @ X40)=>((ap @ X38 @ X39 @ X40 @ X43)=(X44)))))))))=>![X1:$i, X4:$i, X8:$i]:((((subset @ X8 @ (cartprod @ X1 @ X4))&![X45:$i]:(((in @ X45 @ X1)=>?[X46:$i]:(((in @ X46 @ (dsetconstr @ X4 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ X45 @ Z0) @ X8)))))&((dsetconstr @ X4 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ X45 @ Z0) @ X8))))=(setadjoin @ X46 @ emptyset)))))))=>![X9:$i]:((((subset @ X9 @ (cartprod @ X1 @ X4))&![X47:$i]:(((in @ X47 @ X1)=>?[X48:$i]:(((in @ X48 @ (dsetconstr @ X4 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ X47 @ Z0) @ X9)))))&((dsetconstr @ X4 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ X47 @ Z0) @ X9))))=(setadjoin @ X48 @ emptyset)))))))=>(![X2:$i]:(((in @ X2 @ X1)=>((ap @ X1 @ X4 @ X8 @ X2)=(ap @ X1 @ X4 @ X9 @ X2))))=>![X2:$i]:(((in @ X2 @ X1)=>![X7:$i]:(((in @ X7 @ X4)=>((in @ (kpair @ X2 @ X7) @ X9)=>(in @ (kpair @ X2 @ X7) @ X8)))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[funcextLem]), c_0_12]), c_0_13]), c_0_14])])).
0.20/0.49	thf(c_0_16, negated_conjecture, ![X49:$i, X50:$i, X51:$i, X53:$i, X54:$i, X55:$i, X56:$i, X57:$i, X59:$i, X60:$i, X61:$i, X65:$i, X68:$i, X70:$i]:(((((in @ (esk1_3 @ X49 @ X50 @ X51) @ X49)|~(subset @ X51 @ (cartprod @ X49 @ X50))|(~(in @ X54 @ X49)|(in @ (kpair @ X54 @ (ap @ X49 @ X50 @ X51 @ X54)) @ X51)))&(~(in @ X53 @ (dsetconstr @ X50 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ (esk1_3 @ X49 @ X50 @ X51) @ Z0) @ X51)))))|((dsetconstr @ X50 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ (esk1_3 @ X49 @ X50 @ X51) @ Z0) @ X51))))!=(setadjoin @ X53 @ emptyset))|~(subset @ X51 @ (cartprod @ X49 @ X50))|(~(in @ X54 @ X49)|(in @ (kpair @ X54 @ (ap @ X49 @ X50 @ X51 @ X54)) @ X51))))&((((in @ (esk2_3 @ X55 @ X56 @ X57) @ X55)|~(subset @ X57 @ (cartprod @ X55 @ X56))|(~(in @ X60 @ X55)|(~(in @ X61 @ X56)|(~(in @ (kpair @ X60 @ X61) @ X57)|((ap @ X55 @ X56 @ X57 @ X60)=(X61))))))&(~(in @ X59 @ (dsetconstr @ X56 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ (esk2_3 @ X55 @ X56 @ X57) @ Z0) @ X57)))))|((dsetconstr @ X56 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ (esk2_3 @ X55 @ X56 @ X57) @ Z0) @ X57))))!=(setadjoin @ X59 @ emptyset))|~(subset @ X57 @ (cartprod @ X55 @ X56))|(~(in @ X60 @ X55)|(~(in @ X61 @ X56)|(~(in @ (kpair @ X60 @ X61) @ X57)|((ap @ X55 @ X56 @ X57 @ X60)=(X61)))))))&(((subset @ esk5_0 @ (cartprod @ esk3_0 @ esk4_0))&(((in @ (esk6_1 @ X65) @ (dsetconstr @ esk4_0 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ X65 @ Z0) @ esk5_0)))))|~(in @ X65 @ esk3_0))&(((dsetconstr @ esk4_0 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ X65 @ Z0) @ esk5_0))))=(setadjoin @ (esk6_1 @ X65) @ emptyset))|~(in @ X65 @ esk3_0))))&(((subset @ esk7_0 @ (cartprod @ esk3_0 @ esk4_0))&(((in @ (esk8_1 @ X68) @ (dsetconstr @ esk4_0 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ X68 @ Z0) @ esk7_0)))))|~(in @ X68 @ esk3_0))&(((dsetconstr @ esk4_0 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ X68 @ Z0) @ esk7_0))))=(setadjoin @ (esk8_1 @ X68) @ emptyset))|~(in @ X68 @ esk3_0))))&((~(in @ X70 @ esk3_0)|((ap @ esk3_0 @ esk4_0 @ esk5_0 @ X70)=(ap @ esk3_0 @ esk4_0 @ esk7_0 @ X70)))&((in @ esk9_0 @ esk3_0)&((in @ esk10_0 @ esk4_0)&((in @ (kpair @ esk9_0 @ esk10_0) @ esk7_0)&~(in @ (kpair @ esk9_0 @ esk10_0) @ esk5_0)))))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])])).
0.20/0.49	thf(c_0_17, negated_conjecture, ![X1:$i, X2:$i, X4:$i, X7:$i, X6:$i, X5:$i]:((((ap @ X4 @ X2 @ X5 @ X6)=(X7))|~((in @ X1 @ (dsetconstr @ X2 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ (esk2_3 @ X4 @ X2 @ X5) @ Z0) @ X5))))))|((dsetconstr @ X2 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ (esk2_3 @ X4 @ X2 @ X5) @ Z0) @ X5))))!=(setadjoin @ X1 @ emptyset))|~((subset @ X5 @ (cartprod @ X4 @ X2)))|~((in @ X6 @ X4))|~((in @ X7 @ X2))|~((in @ (kpair @ X6 @ X7) @ X5)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.49	thf(c_0_18, negated_conjecture, ![X1:$i]:(((in @ (esk8_1 @ X1) @ (dsetconstr @ esk4_0 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ X1 @ Z0) @ esk7_0)))))|~((in @ X1 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.49	thf(c_0_19, negated_conjecture, ![X1:$i]:((((dsetconstr @ esk4_0 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ X1 @ Z0) @ esk7_0))))=(setadjoin @ (esk8_1 @ X1) @ emptyset))|~((in @ X1 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.49	thf(c_0_20, negated_conjecture, ![X1:$i, X2:$i, X6:$i, X5:$i, X4:$i]:(((in @ (esk2_3 @ X1 @ X2 @ X4) @ X1)|((ap @ X1 @ X2 @ X4 @ X5)=(X6))|~((subset @ X4 @ (cartprod @ X1 @ X2)))|~((in @ X5 @ X1))|~((in @ X6 @ X2))|~((in @ (kpair @ X5 @ X6) @ X4)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.49	thf(c_0_21, negated_conjecture, (in @ (kpair @ esk9_0 @ esk10_0) @ esk7_0), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.49	thf(c_0_22, negated_conjecture, ![X4:$i, X2:$i, X1:$i]:((((ap @ X1 @ esk4_0 @ esk7_0 @ X2)=(X4))|~((in @ (esk2_3 @ X1 @ esk4_0 @ esk7_0) @ esk3_0))|~((subset @ esk7_0 @ (cartprod @ X1 @ esk4_0)))|~((in @ (kpair @ X2 @ X4) @ esk7_0))|~((in @ X4 @ esk4_0))|~((in @ X2 @ X1)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])).
0.20/0.49	thf(c_0_23, negated_conjecture, ![X2:$i, X1:$i]:((((ap @ X1 @ X2 @ esk7_0 @ esk9_0)=(esk10_0))|(in @ (esk2_3 @ X1 @ X2 @ esk7_0) @ X1)|~((subset @ esk7_0 @ (cartprod @ X1 @ X2)))|~((in @ esk10_0 @ X2))|~((in @ esk9_0 @ X1)))), inference(spm,[status(thm)],[c_0_20, c_0_21])).
0.20/0.49	thf(c_0_24, negated_conjecture, (subset @ esk7_0 @ (cartprod @ esk3_0 @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.49	thf(c_0_25, negated_conjecture, (in @ esk10_0 @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.49	thf(c_0_26, negated_conjecture, (in @ esk9_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.49	thf(c_0_27, negated_conjecture, ![X2:$i, X1:$i]:((((ap @ esk3_0 @ esk4_0 @ esk7_0 @ esk9_0)=(esk10_0))|((ap @ esk3_0 @ esk4_0 @ esk7_0 @ X1)=(X2))|~((in @ (kpair @ X1 @ X2) @ esk7_0))|~((in @ X2 @ esk4_0))|~((in @ X1 @ esk3_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24]), c_0_25]), c_0_26])])).
0.20/0.49	thf(c_0_28, negated_conjecture, ![X1:$i, X2:$i, X5:$i, X6:$i, X4:$i]:(((in @ (kpair @ X6 @ (ap @ X4 @ X2 @ X5 @ X6)) @ X5)|~((in @ X1 @ (dsetconstr @ X2 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ (esk1_3 @ X4 @ X2 @ X5) @ Z0) @ X5))))))|((dsetconstr @ X2 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ (esk1_3 @ X4 @ X2 @ X5) @ Z0) @ X5))))!=(setadjoin @ X1 @ emptyset))|~((subset @ X5 @ (cartprod @ X4 @ X2)))|~((in @ X6 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.49	thf(c_0_29, negated_conjecture, ![X1:$i]:(((in @ (esk6_1 @ X1) @ (dsetconstr @ esk4_0 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ X1 @ Z0) @ esk5_0)))))|~((in @ X1 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.49	thf(c_0_30, negated_conjecture, ![X1:$i]:((((dsetconstr @ esk4_0 @ (^[Z0/* 3 */:$i]:((in @ (kpair @ X1 @ Z0) @ esk5_0))))=(setadjoin @ (esk6_1 @ X1) @ emptyset))|~((in @ X1 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.49	thf(c_0_31, negated_conjecture, ![X1:$i]:((((ap @ esk3_0 @ esk4_0 @ esk5_0 @ X1)=(ap @ esk3_0 @ esk4_0 @ esk7_0 @ X1))|~((in @ X1 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.49	thf(c_0_32, negated_conjecture, ((ap @ esk3_0 @ esk4_0 @ esk7_0 @ esk9_0)=(esk10_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_21]), c_0_25]), c_0_26])])).
0.20/0.49	thf(c_0_33, negated_conjecture, ![X2:$i, X5:$i, X4:$i, X1:$i]:(((in @ (esk1_3 @ X1 @ X2 @ X4) @ X1)|(in @ (kpair @ X5 @ (ap @ X1 @ X2 @ X4 @ X5)) @ X4)|~((subset @ X4 @ (cartprod @ X1 @ X2)))|~((in @ X5 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.49	thf(c_0_34, negated_conjecture, (subset @ esk5_0 @ (cartprod @ esk3_0 @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.49	thf(c_0_35, negated_conjecture, ![X1:$i, X2:$i]:(((in @ (kpair @ X1 @ (ap @ X2 @ esk4_0 @ esk5_0 @ X1)) @ esk5_0)|~((in @ (esk1_3 @ X2 @ esk4_0 @ esk5_0) @ esk3_0))|~((subset @ esk5_0 @ (cartprod @ X2 @ esk4_0)))|~((in @ X1 @ X2)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30])).
0.20/0.49	thf(c_0_36, negated_conjecture, ((ap @ esk3_0 @ esk4_0 @ esk5_0 @ esk9_0)=(esk10_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_26])])).
0.20/0.49	thf(c_0_37, negated_conjecture, ~((in @ (kpair @ esk9_0 @ esk10_0) @ esk5_0)), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.49	thf(c_0_38, negated_conjecture, ![X1:$i]:(((in @ (kpair @ X1 @ (ap @ esk3_0 @ esk4_0 @ esk5_0 @ X1)) @ esk5_0)|(in @ (esk1_3 @ esk3_0 @ esk4_0 @ esk5_0) @ esk3_0)|~((in @ X1 @ esk3_0)))), inference(spm,[status(thm)],[c_0_33, c_0_34])).
0.20/0.49	thf(c_0_39, negated_conjecture, ~((in @ (esk1_3 @ esk3_0 @ esk4_0 @ esk5_0) @ esk3_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_34]), c_0_26])]), c_0_37])).
0.20/0.49	thf(c_0_40, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_36]), c_0_26])]), c_0_37]), c_0_39]), ['proof']).
0.20/0.49	# SZS output end CNFRefutation
0.20/0.49	# Parsed axioms                        : 21
0.20/0.49	# Removed by relevancy pruning/SinE    : 14
0.20/0.49	# Initial clauses                      : 15
0.20/0.49	# Removed in clause preprocessing      : 0
0.20/0.49	# Initial clauses in saturation        : 15
0.20/0.49	# Processed clauses                    : 49
0.20/0.49	# ...of these trivial                  : 0
0.20/0.49	# ...subsumed                          : 0
0.20/0.49	# ...remaining for further processing  : 48
0.20/0.49	# Other redundant clauses eliminated   : 0
0.20/0.49	# Clauses deleted for lack of memory   : 0
0.20/0.49	# Backward-subsumed                    : 3
0.20/0.49	# Backward-rewritten                   : 1
0.20/0.49	# Generated clauses                    : 37
0.20/0.49	# ...of the previous two non-redundant : 34
0.20/0.49	# ...aggressively subsumed             : 0
0.20/0.49	# Contextual simplify-reflections      : 5
0.20/0.49	# Paramodulations                      : 37
0.20/0.49	# Factorizations                       : 0
0.20/0.49	# NegExts                              : 0
0.20/0.49	# Equation resolutions                 : 0
0.20/0.49	# Total rewrite steps                  : 20
0.20/0.49	# Propositional unsat checks           : 0
0.20/0.49	#    Propositional check models        : 0
0.20/0.49	#    Propositional check unsatisfiable : 0
0.20/0.49	#    Propositional clauses             : 0
0.20/0.49	#    Propositional clauses after purity: 0
0.20/0.49	#    Propositional unsat core size     : 0
0.20/0.49	#    Propositional preprocessing time  : 0.000
0.20/0.49	#    Propositional encoding time       : 0.000
0.20/0.49	#    Propositional solver time         : 0.000
0.20/0.49	#    Success case prop preproc time    : 0.000
0.20/0.49	#    Success case prop encoding time   : 0.000
0.20/0.49	#    Success case prop solver time     : 0.000
0.20/0.49	# Current number of processed clauses  : 29
0.20/0.49	#    Positive orientable unit clauses  : 7
0.20/0.49	#    Positive unorientable unit clauses: 0
0.20/0.49	#    Negative unit clauses             : 2
0.20/0.49	#    Non-unit-clauses                  : 20
0.20/0.49	# Current number of unprocessed clauses: 15
0.20/0.49	# ...number of literals in the above   : 107
0.20/0.49	# Current number of archived formulas  : 0
0.20/0.49	# Current number of archived clauses   : 19
0.20/0.49	# Clause-clause subsumption calls (NU) : 68
0.20/0.49	# Rec. Clause-clause subsumption calls : 11
0.20/0.49	# Non-unit clause-clause subsumptions  : 8
0.20/0.49	# Unit Clause-clause subsumption calls : 8
0.20/0.49	# Rewrite failures with RHS unbound    : 0
0.20/0.49	# BW rewrite match attempts            : 10
0.20/0.49	# BW rewrite match successes           : 1
0.20/0.49	# Condensation attempts                : 49
0.20/0.49	# Condensation successes               : 0
0.20/0.49	# Termbank termtop insertions          : 5026
0.20/0.49	
0.20/0.49	# -------------------------------------------------
0.20/0.49	# User time                : 0.009 s
0.20/0.49	# System time              : 0.004 s
0.20/0.49	# Total time               : 0.013 s
0.20/0.49	# Maximum resident set size: 2056 pages
0.20/0.49	
0.20/0.49	# -------------------------------------------------
0.20/0.49	# User time                : 0.010 s
0.20/0.49	# System time              : 0.007 s
0.20/0.49	# Total time               : 0.017 s
0.20/0.49	# Maximum resident set size: 1736 pages
0.20/0.49	% E---3.1 exiting
0.20/0.49	EOF